Meta-He digital signatures based on factoring and discrete logarithms
نویسندگان
چکیده
This study investigates all variations of the He’s digital signature scheme based on factoring and discrete logarithms. In contrast to three modular exponentiation computation, the optimal two schemes of generalized He’s signature verification reveals that only two modular exponentiation is needed for signature verification. Key-Words: Digital signature, Batch verify, Computation complexity.
منابع مشابه
Novel Digital Signature Schemes based on Factoring and Discrete Logarithms
In the paper, we propose a new digital signature scheme based on factoring and discrete logarithms. Specially, we prove that the security of the proposed signature scheme is based on both the security of the ElGamal signature scheme and the security of the modified OSS signature scheme. This is the first scheme which can be proved that its security is based on two hard problems. Like Meta-ElGam...
متن کاملA Provably Secure Signature Scheme based on Factoring and Discrete Logarithms
To make users put much confidence in digital signatures, this paper proposes the first provably secure signature scheme based on both factoring and discrete logarithms. The new scheme incorporates both the Schnorr signature scheme and the PSS-Rabin signature scheme. Unless both the two cryptographic assumptions could be become solved simultaneously, anyone would not forge any signature. The pro...
متن کاملNew ID-Based Digital Signature Scheme on Factoring and Discrete Logarithms
The past years have seen many attempts to construct identity based signature schemes on a single hard problem, like factoring or discrete logarithms. But in the near future, those systems will no longer be secure if the solution of factoring or discrete logarithms problems is discovered. In this paper, we propose a new identification based signature scheme on factoring (FAC) problem and discret...
متن کاملA New Design Partially Blind Signature Scheme Based on Two Hard Mathematical Problems
Recently, many existing partially blind signature scheme based on a single hard problem such as factoring, discrete logarithm, residuosity or elliptic curve discrete logarithm problems. However sooner or later these systems will become broken and vulnerable, if the factoring or discrete logarithms problems are cracked. This paper proposes a secured partially blind signature scheme based on fact...
متن کاملA Publicly Verifiable Authenticated Encryption Scheme Based on Factoring and Discrete Logarithms
In this article, we propose a publicly verifiable authenticated encryption scheme based on factoring and discrete logarithms. We point out that even if either factoring or discrete logarithms is broken, this scheme still could keep the authentication, integration, and confidentiality of the message.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Applied Mathematics and Computation
دوره 165 شماره
صفحات -
تاریخ انتشار 2005